Order-Optimal Consensus Through Randomized Path Averaging
نویسندگان
چکیده
منابع مشابه
Gossip along the way: Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. However for many topologies that are realistic for wireless ad-hoc and sensor networks (like grids and random geometric graphs), the standard nearest-neighbor gossip converges very slowly. A recently proposed algorithm ...
متن کاملAn optimal first order method based on optimal quadratic averaging
In a recent paper, Bubeck, Lee, and Singh introduced a new first order method for minimizing smooth strongly convex functions. Their geometric descent algorithm, largely inspired by the ellipsoid method, enjoys the optimal linear rate of convergence. We show that the same iterate sequence is generated by a scheme that in each iteration computes an optimal average of quadratic lower-models of th...
متن کاملRandomized Optimal Consensus of Multi-agent Systems
In this paper, we formulate and solve a randomized optimal consensus problem for multiagent systems with stochastically time-varying interconnection topology. The considered multi-agent system with a simple randomized iterating rule achieves an almost sure consensus meanwhile solving the optimization problem minz∈Rd ∑n i=1 fi(z), in which the optimal solution set of objective function fi corres...
متن کاملOptimal project planning through feasible path analysis
In this paper we present a powerful technique for analysing production networks in the presence of decision-making variables and cost exibility. Processes are modelled as a network , similar to PERT/CPM schemes, but with built-in decision and cost variables. For minimal increased complexity in the development of the network, we show that powerful analysis and optimisation techniques are enabled...
متن کاملConvergence Speed in Distributed Consensus and Averaging
We propose three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case. The convergence times of our fixed-graph algorithms compare favorably with other known methods, while our algorithm for the dynamic-topology case is the first to be accompanied by a polynomial-time bound on the worst-case convergence time. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2060050